Bias in Monte Carlo Simulations Due To Pseudo-Random Number Generator Initial Seed Selection
نویسندگان
چکیده
Pseudo-random number generators can bias Monte Carlo simulations of the standard normal probability distribution function with initial seeds selection. Five generator designs were initial-seeded with values from 10000 HEX to 1FFFF HEX , estimates of the mean were calculated for each seed, the distribution of mean estimates was determined for each generator and simulation histories were graphed for selected seeds. Introduction It is possible, using a vetted pseudo-random number generator and a specific initial seed, to produce number sequences that may have very nonrandom-like characteristics; however, restarting the algorithm with a new seed will produce an excellent number sequence. Park and Miller (1988) asserted that coding errors in the algorithm might be responsible, although, in a vetted generator, coding errors are unlikely. (See Fishman (1995) for descriptions of other possible reasons for this phenomenon.)
منابع مشابه
Simulation of a directed random-walk model: the effect of pseudo-random-number correlations
We investigate the mechanism that leads to systematic deviations in cluster Monte Carlo simulations when correlated pseudo-random numbers are used. We present a simple model, which enables an analysis of the effects due to correlations in several types of pseudo-random-number sequences. This model provides qualitative understanding of the bias mechanism in a class of cluster Monte Carlo algorit...
متن کاملPseudo-random number generators for Monte Carlo simulations on ATI Graphics Processing Units
Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX generator is fo...
متن کاملExploring pseudo- and chaotic random Monte Carlo simulations
Computer simulations are an increasingly important area of geoscience research and development. At the core of stochastic or Monte Carlo simulations are the random number sequences that are assumed to be distributed with specific characteristics. Computer-generated random numbers, uniformly distributed on (0, 1), can be very different depending on the selection of pseudo-random number (PRN) or ...
متن کاملThe Monte Carlo Algorithm with a Pseudorandom Generator
We analyze the Monte Carlo algorithm for the approximation of multivariate integrals when a pseudorandom generator is used. We establish lower and upper bounds on the error of such algorithms. We prove that as long as a pseudorandom generator is capable of producing only finitely many points, the Monte Carlo algorithm with such a pseudorandom generator fails for ¿2 or continuous functions. It a...
متن کاملPseudo Random Coins Show More Heads Than Tails
Tossing a coin is the most elementary Monte-Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not capable of imitating a fair coin: pseudo random coins show more ‘‘heads’’ than ‘‘tails.’’ This bias explains the empirically observed failure of some random numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013